package base.sort;

/**
 *                                          时间复杂度
 * 01 冒泡排序 {@link BubbleSort}              O(n^2)
 * 02 选择排序 {@link SelectionSort}           O(n^2)
 * 03 插入排序 {@link InsertSort}              O(n^2)
 *
 * 04 希尔排序 {@link ShellSort}               O(n log n)
 * 05 归并排序 {@link MergeSort}               O(n log n)
 * 06 快速排序 {@link QuickSort}               O(n log n)
 * 07 堆排序   {@link HeapSort}                O(n log n)
 *
 * 08 计数排序 {@link CoutingSort}             O(n+k)
 * 09 桶排序   {@link BucketSort}              O(n+k)
 * 10 基数排序 {@link RadixSort}               O(n*k)
 *
 */
public interface IArraySort {
    public int[] sort(int[] sourceArray) throws Exception;
}
